ACO Algorithms for the Quadratic Assignment Problem
نویسندگان
چکیده
منابع مشابه
An Experimental Investigation of Iterated Ants for the Quadratic Assignment Problem
Ant Colony Optimization (ACO) algorithms construct solutions each time starting from scratch, that is, from an empty solution. Similar to ACO, Iterated Greedy is a constructive stochastic local search (SLS) method. However, differently from ACO, Iterated Greedy starts the solution construction from partial solutions. In this paper we examine the performance of a variation of MAX–MIN Ant System,...
متن کاملA Hybrid Ant Colony Algorithm for Quadratic Assignment Problem
Quadratic assignment problem (QAP) is one of fundamental combinatorial optimization problems in many fields. Many real world applications such as backboard wiring, typewriter keyboard design and scheduling can be formulated as QAPs. Ant colony algorithm is a multi-agent system inspired by behaviors of real ant colonies to solve optimization problems. Ant colony optimization (ACO) is one of new ...
متن کاملParallel Ant Colony Optimization for the Quadratic Assignment Problems with Symmetric Multi Processing
Recently symmetric multi processing (SMP) has become available at a reasonable cost. In this paper, we propose several types of parallel ACO algorithms with SMP for solving the quadratic assignment problem (QAP). These models include the master-slave models and the island models. We evaluated each parallel algorithm with a condition that the run time for each parallel algorithm and the base seq...
متن کاملA Detailed Analysis of the Population-Based Ant Colony Optimization Algorithm for the TSP and the QAP
The population-based ant colony optimization algorithm (PACO) uses a very different pheromone update when compared to other ACO algorithms. In this work, we study P-ACO’s behavior for solving the traveling salesman problem (TSP) and the quadratic assignment problem (QAP). In particular, we investigate the impact of a local search on P-ACO parameters and performance. The results clearly show tha...
متن کاملAnt Colony Optimization: A Component-Wise Overview
The indirect communication and foraging behavior of certain species of ants has inspired a number of optimization algorithms for NP-hard problems. These algorithms are nowadays collectively known as the ant colony optimization (ACO) metaheuristic. This chapter gives an overview of the history of ACO, explains in detail its algorithmic components and summarizes its key characteristics. In additi...
متن کامل